629B - Far Relative’s Problem - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
 
const int DAYS = 371;
int party[2][DAYS];
// 0 -> female
// 1 -> male
 
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	
	vector<pair<int,int>> male;
	vector<pair<int,int>> female;
	
	for(int i = 0; i < n; i++){
		char s;
		int a, b;
		cin >> s >> a >> b;
		if(s == 'F') female.push_back({a, b});
		else male.push_back({a, b});
	}
	
	int m = male.size();
	int f = female.size();
	
	if(m == 0 or f == 0){
		cout << 0 << '\n';
		return 0;
	}
	
	for(int i = 1; i <= 366; i++){
		for(int j = 0; j < m; j++){
			if(male[j].first <= i and i <= male[j].second){
				party[1][i]++;
			}
		}
		
		for(int k = 0; k < f; k++){
			if(female[k].first <= i and i <= female[k].second){
				party[0][i]++;
			}
		}
	}
	
	int ans = 0;
	
	for(int i = 1; i <= 366; i++){
		ans = max(ans, min(party[0][i], party[1][i])); 
	}
	
	cout << ans*2 << '\n';
	return 0;
}